Algoritmo de booth-karatsuba en operaciones aditivas
نویسندگان
چکیده
منابع مشابه
Memorias Asociativas Basadas en Relaciones de Orden y Operaciones Binarias
A new model for associative memories is proposed in this paper. The mathematical tools used in this new model, include two binary operators designed specifically for the memories developed here. These operators were arbitrarí/y named as the .first two letters from the Greek alphabet: a and fJ. The new associative memories (afJ)are oftwo kinds and are able to operate in two different modes. The ...
متن کاملAlgoritmo de emparejamiento de perfiles en Servicios Web Semánticos
This paper describes the main characteristics of an algorithm for matching Semantic Web Services. The algorithm takes advantage of the capacities provided by ontologies that describe services and constitutes an improvement when compared to existing proposals. In addition, the main elements related with the implementation are also described. The system interacts with ontologies of descriptions o...
متن کاملIntegración de reordenamientos en el algoritmo de decodificación en traducción automática estocástica
This paper presents a reordering framework for statistical machine translation (SMT) where source-side reorderings are integrated into SMT decoding, allowing for a highly constrained reordered search graph. The monotone search is extended by means of a set of reordering patterns (linguistically motivated rewrite patterns). Patterns are automatically learnt in training from word-to-word alignmen...
متن کاملTranscripción fonética de acrónimos en castellano utilizando el algoritmo C4.5
This work presents an automatic acronyms transcription system in order to increase the synthetic speech quality of text-to-speech systems, in the presence of acronyms in the input text. The acronyms transcription is conducted by using a decision tree (C4.5 algorithm). The work presents the results obtained for different algorithm configurations, validating its performance with respect to other ...
متن کاملRENTOL: Un algoritmo de agrupamiento basado en K-means
Resumen. Sin lugar a duda el algoritmo K-means es el más utilizado en la comunidad de aprendizaje no supervisado. Desafortunadamente es muy sensible a la selección de los centroides iniciales. Debido a ello, se han propuesto un gran número de métodos para la selección de los centros iniciales. En este artículo se presenta un algoritmo de agrupamiento que tiene como base al algoritmo K-means, en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 3C TIC : Cuadernos de desarrollo aplicados a las TIC
سال: 2018
ISSN: 2254-6529
DOI: 10.17993/3ctic.2018.62.30-59